Generic global rigidity of body-bar frameworks

نویسندگان

  • Robert Connelly
  • Tibor Jordán
  • Walter Whiteley
چکیده

A basic geometric question is to determine when a given framework G(p) is globally rigid in Euclidean space Rd, where G is a finite graph and p is a configuration of points corresponding to the vertices of G. G(p) is globally rigid in Rd if for any other configuration q for G such that the edge lengths of G(q) are the same as the corresponding edge lengths of G(p), then p is congruent to q. A framework G(p) is redundantly rigid, if it is rigid and it remains rigid after the removal of any edge of G. Hendrickson [9] proved that redundant rigidity is a necessary condition for generic global rigidity, as is (d+1)-connectivity. Recent results in [2] and [10] have shown that when the configuration p is generic and d = 2, redundant rigidity and 3-connectivity are also sufficient a good combinatorial characterization that only depends on G and can be checked in polynomial time. It appears that a similar result for d = 3 is beyond the scope of present techniques ∗Department of Mathematics, Cornell University, Ithaca, NY 14853, USA. Research supported in part by NSF Grant No. DMS–0209595 (USA). e-mail: [email protected] †Department of Operations Research, Eötvös University, Pázmány sétány 1/C, 1117 Budapest, Hungary. Supported by the MTA-ELTE Egerváry Research Group on Combinatorial Optimization and the Hungarian Scientific Research Fund grant no. T49671, T60802. e-mail: [email protected] ‡Department of Mathematics and Statistics, York University, 4700 Keele Street, Toronto, ON M3J 1P3, Canada. Research supported in part by a grant from NSERC (Canada). e-mail: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the universal rigidity of generic bar frameworks

In this paper, we present a sufficient condition for the universal rigidity of a generic bar framework G(p) in terms of the Gale matrix Z corresponding to G(p). We also establish a relationship between the stress matrix S and the Gale matrix Z for bar frameworks. This allows us to translate back and forth between S and Z in recently obtained results concerning universal rigidity, global rigidit...

متن کامل

The rigidity of periodic body-bar frameworks on the three-dimensional fixed torus.

We present necessary and sufficient conditions for the generic rigidity of body-bar frameworks on the three-dimensional fixed torus. These frameworks correspond to infinite periodic body-bar frame-works in with a fixed periodic lattice.

متن کامل

On Global Rigidity and Universal Rigidity of Generic Bar Frameworks with Few Vertices

Gale transform was successfully used to classify polytopes with few vertices; that is, r-dimensional polytopes with r + k vertices, where k is small. In this paper, we use Gale transform to classify r-dimensional generic bar frameworks with r + k vertices, where k ≤ 4; as universally rigid, globally rigid or nonglobally rigid.

متن کامل

Generic Rigidity Matroids with Dilworth Truncations

We prove that the linear matroid that defines the generic rigidity of d-dimensional bodyrod-bar frameworks (i.e., structures consisting of disjoint bodies and rods mutually linked by bars) can be obtained from the union of ( d+1 2 ) copies of a graphic matroid by applying variants of Dilworth truncation operations nr times, where nr denotes the number of rods. This result leads to an alternativ...

متن کامل

Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks

We propose new symmetry-adapted rigidity matrices to analyze the infinitesimal rigidity of arbitrary-dimensional bar-joint frameworks with Abelian point group symmetries. These matrices define new symmetry-adapted rigidity matroids on grouplabeled quotient graphs. Using these new tools, we establish combinatorial characterizations of infinitesimally rigid two-dimensional bar-joint frameworks wh...

متن کامل

Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries

As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph G = (V,E), a multiset R = {r1, . . . , rt} of vertices in V , and a matroid M on R. We prove a necessary and sufficient condition for G to be decomposed into t edge-disjoint subgraphs G1 = ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 103  شماره 

صفحات  -

تاریخ انتشار 2013